Using polynomial optimization to solve the fuel-optimal linear impulsive rendezvous problem

نویسندگان

  • Denis Arzelier
  • Mounir Kara-Zaitri
  • Christophe Louembet
چکیده

Nomenclature a = semi-major axis ; e = eccentricity ; ν = true anomaly ; φ(ν) = fundamental matrix of relative motion ; B(ν) = input matrix in the dynamic model of relative motion ; R(ν) = φ(ν)B(ν) = φ(ν)B(ν) = primer vector evolution matrix ; uf = φ(νf )Xf − φ(ν1)X1 6= 0 = boundary conditions ; N = number of velocity increments ; νi, ∀ i = 1, · · · , N = impulses application times ; ∆vi = impulse modulus at νi ;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using polynomial optimization to solve the fuel-optimal impulsive rendezvous problem

The optimal fuel impulsive time-fixed rendezvous problem is reviewed. In a linear setting, it may be reformulated as a nonconvex polynomial optimization problem for a pre-specified fixed number of velocity increments. A numerical algorithm using a convex relaxation based on a sum-of-squares representation of positive polynomials is first proposed. Its numerical efficiency is assessed using a cl...

متن کامل

A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

The optimal fuel impulsive time-fixed rendezvous problem is reviewed. In a linear setting, it may be reformulated as a non convex polynomial optimization problem for a pre-specified fixed number of velocity increments. Relying on variational results previously published in the literature, an improved mixed iterative algorithm is defined to address the issue of optimization over the number of im...

متن کامل

Solving Fuel-optimal Impulsive Rendezvous Problem Using Primer Vector Theory and Real Algebraic Geometry

Abstract. In this paper, the optimal fuel impulsive time-fixed rendezvous problem is considered. Under some simplifying assumptions, this problem may be recast as a non convex polynomial optimization problem. A numerical solving algorithm using a convex relaxation based on sum-of-squares representation of positive polynomials is proposed. Numerical results are evaluated on two examples and chec...

متن کامل

Analysis and Control of Partial Differential Equations using Occupation Measures

Context This work is in the line of research with the following issue: how to develop new convex optimization techniques based on semidefinite programming (SDP) and real algebraic geometry to solve optimal control problems (OCP) in a nonlinear setting. Recently, several research efforts allowed to solve numerically certain optimal control problems with polynomial data. The general idea is to re...

متن کامل

Measures and LMI for impulsive optimal control with applications to orbital rendezvous problems

This paper shows how to use semi-definite programming to find lower bounds on (and sometimes solve globally) a large class of nonlinear optimal control problems. This is done by relaxing an optimal control problem into a linear programming problem on measures, also known as a generalized moment problem. The handling of measures by their moments reduces the problem to a convergent series of stan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011